Spatial search using discrete quantum walks
نویسندگان
چکیده
We study the quantum walk search algorithm of Shenvi, Kempe, and Whaley [PRA 67 052307 (2003)] on data structures of one to two spatial dimensions, on which the algorithm is less efficient than in three or more spatial dimensions. Our aim is to understand why the quantum algorithm is dimension dependent whereas the best classical algorithm is not, and to find in more detail how the efficiency of the quantum algorithm varies with spatial dimension or accessibility of the data.
منابع مشابه
Quantum random walk search on satisfiability problems
Using numerical simulation, we measured the performance of several potential quantum algorithms, based on quantum random walks, to solve Boolean satisfiability (SAT) problems. We develop the fundamentals of quantum computing and the theory of classical algorithms to indicate how these algorithms could be implemented. We also discuss the development of quantum random walks and the principles tha...
متن کاملMultiple Quantum Walkers on the Line Using Hybrid Coins: a Possible Tool for Quantum Search
In this paper discrete quantum walks with different coins used for odd and even time steps are studied. These coins are called hybrid. The calculation results are compared with the most frequently used coin, the Hadamard transform. Furthermore, quantum walks on the line which involve two or more quantum walkers with hybrid coins are studied. Quantum walks with entangled walkers and hybrid coins...
متن کاملPARTICLE SWARM-GROUP SEARCH ALGORITHM AND ITS APPLICATION TO SPATIAL STRUCTURAL DESIGN WITH DISCRETE VARIABLES
Based on introducing two optimization algorithms, group search optimization (GSO) algorithm and particle swarm optimization (PSO) algorithm, a new hybrid optimization algorithm which named particle swarm-group search optimization (PS-GSO) algorithm is presented and its application to optimal structural design is analyzed. The PS-GSO is used to investigate the spatial truss structures with discr...
متن کاملMixing Times in Quantum Walks on Two-Dimensional Grids
Mixing properties of discrete-time quantum walks on two-dimensional grids with torus-like boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an exact expression for the stationary distribution of the coherent walk over odd-sided lattices is obtained after solving the eigenproblem for the evolution opera...
متن کاملLocalization of Discrete Time Quantum Walks on the Glued Trees
In this paper, we consider the time averaged distribution of discrete time quantum walks on the glued trees. In order to analyze the walks on the glued trees, we consider a reduction to the walks on path graphs. Using a spectral analysis of the Jacobi matrices defined by the corresponding random walks on the path graphs, we have a spectral decomposition of the time evolution operator of the qua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009